The conjugacy problem for graph products with cyclic edge groups
نویسندگان
چکیده
منابع مشابه
The Conjugacy Problem for Graph Products with Cyclic Edge Groups
A graph product is the fundamental group of a graph of groups Amongst the simplest examples are HNN groups and free products with amalgamation. The conjugacy problem is solvable for recursively presented graph products with cyclic edge groups over finite graphs if the vertex groups have solvable conjugacy problem and the sets of cyclic generators in them are semicritical. For graph products ove...
متن کاملThe Conjugacy Problem for Finite Graph Products
A finite graph product is the fundamental group of a finite graph of groups. Finite graph products with finite cyclic edge groups are shown to inherit a solvable conjugacy problem from their vertex groups under certain conditions, of which the most important is that all the edge group generators in each vertex group are powers of a common central element.
متن کاملCOMPUTING THE PRODUCTS OF CONJUGACY CLASSES FOR SPECIFIC FINITE GROUPS
Suppose $G$ is a finite group, $A$ and $B$ are conjugacy classes of $G$ and $eta(AB)$ denotes the number of conjugacy classes contained in $AB$. The set of all $eta(AB)$ such that $A, B$ run over conjugacy classes of $G$ is denoted by $eta(G)$.The aim of this paper is to compute $eta(G)$, $G in { D_{2n}, T_{4n}, U_{6n}, V_{8n}, SD_{8n}}$ or $G$ is a decomposable group of order $2pq$, a group of...
متن کاملAn edge coloring problem for graph products
The edges of the Cartesian product of graphs G x Hare to be colored with the condition that all rectangles, i.e., K2 x K2 subgraphs, must be colored with four distinct colors. The minimum number of colors in such colorings is determined for all pairs of graphs except when G is 5-chromatic and H is 4or 5-chromatic.
متن کاملSolving the conjugacy problem in Garside groups by cyclic sliding
1 We present a solution to the conjugacy decision problem and the conjugacy search problem 2 in Garside groups, which is theoretically simpler than the usual one, with no loss of efficiency. 3 This is done by replacing the well known cycling and decycling operations by a new one, 4 called cyclic sliding, which appears to be a more natural choice. 5 We give an analysis of the complexity of our a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1983
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1983-0684622-9